Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
41	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity
42	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
43	. CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2016-03-29 21:49:55 Mathematics Operations research Applied mathematics Computational complexity theory Algorithms Sorting algorithms Analysis of algorithms Divide and conquer algorithms Selection algorithm Time complexity Merge sort Fast Fourier transform
44	Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:12 Computational complexity theory Analysis of algorithms Theory of computation Mathematics Edsger W. Dijkstra Algorithm Mathematical logic Theoretical computer science Time complexity Shortest path problem Asymptotically optimal algorithm Randomized algorithm
45	Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2009-11-01 20:46:02 Mathematics Arithmetic Computational complexity theory Multiplication Algebra Finite fields Karatsuba algorithm XTR Polynomials Recurrence relation Time complexity Algorithm
46	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
47	A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Complexity classes Theory of computation Polynomial-time approximation scheme APX Strong NP-completeness NP
48	Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers∗ Hiroshi Fujiwara† Topic classification: Algorithms and data structures Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:02:45 Circuit complexity NC Constructible universe Net Ordinal number Mathematics Creativity Abstraction
49	Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Theory of computation Complexity classes Strong NP-completeness Polynomial-time approximation scheme Bin Packing problems NP-complete problems Bin packing problem

UPDATE